#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
    int maxWidthOfVerticalArea(vector<vector<int>>& points) {
        sort(points.begin(),points.end(),[](const auto &c1,const auto &c2){
            return c1[0]<c2[0]||(c1[0]==c2[0]&&c1[1]<c2[1]);
        });
        int max_=INT_MIN;
        for(int i=0,j=1;j<points.size();i++,j++)
        {
            if(max_<(points[j][0]-points[i][0]))
                max_=points[j][0]-points[i][0];
        }
        return max_;
    }
};